传感器管理及其在相控阵雷达中的应用

传感器管理是数据融合的一部分。介绍了传感器管理的概念和框架 ,概述了国内外传感器管理算法的研究现状。主要工作是针对相控阵雷达这一传感器 ,通过对其不同工作模式以及不同参数的管理 ,来说明传感器管理的原理。提出了一种新的自适应采样周期算法 ,仿真结果表明该算法的优越性     

移动信息接收机的研制

介绍了一种新型的通信传媒设备，详细介绍了该接收机的工作机理、结构、功能特点以及软硬件的设计思路。     

一种微透镜阵列的研制

介绍一种利用表面张力的作用、以光纤作材料、用分离的自聚焦透镜制作微透镜阵型的方法，这种方法具有制作工艺简单、无须昂贵设备等优点，用此方法实际制作了具有良好连续面型的微透镜阵列，并对制作的微透镜阵列进行了测试，效果较好。     

自由曲面五坐标数控加工干涉检查

提出了一种新方法，用于环刀五坐标数控加工的干涉检查。该方法将干涉检查分为刀轴及侧刃干涉检查和端面干涉检查。首先将加工曲面分片，选取合适的初始点。然后利用自由曲面的微分特性，确定跟踪方向和步长，迅速计算出工件和刀具的最短距离，从而判断是否发生干涉。实验仿真表明，达到同样精度时，该算法计算效率远高于常规的三角面片法。     

电力系统谐波检测的现状与发展

准确、实时地对电力系统谐波进行检测有着重要的意义。本文根据电力系统谐波测量的基本方法，对近年来电力系统谐波检测的新方法进行了分析和评述。最后对电力系统的谐波测量进行了总结并提出了看法。     

厚膜永磁阵列微致动器的磁路研究

研究了厚膜永磁阵列微致动器中的磁场分布，并研究了永磁阵列单元几何尺寸对微致动器电磁力的影响。结果表明，厚膜永磁阵列单元高宽比和磁体单元间隔对微致动器电磁力影响较大磁徕单元高宽比为0．7是一个比较合适的尺寸。     

测量光纤放大器小信号增益谱的一种简便方法

提出了一种用小功率宽带光源较精确测量光纤放大器小信号增益谱的方法。数值模拟表明 ,该方法是完全可行的 ,并且实验结果与数值模拟结果一致。该方法具有简便、易操作的特点。     

Performance analysis of OFDMA uplink systems with symbol timing misalignment

This letter presents our investigation for the effect of symbol timing errors in orthogonal frequency-division multiple access (OFDMA) uplink systems. We express the symbol timing errors between users as the symbol timing misalignments with respect to the desired user. Then, we derive an explicit expression of the signal-to-noise ratio (SNR) as a function of the maximum value of the symbol timing misalignments. Analyses and simulation results show that, to achieve an SNR of 20 dB, the maximum value of the symbol timing misalignments must be less than the cyclic prefix duration plus 6.25% of the useful symbol duration. Based on the resulting SNR degradation, we evaluate the SNR gain with guard subcarriers in order to mitigate the effect of the symbol timing misalignments.     

试论循环水装置的经济性及其成本分析

通过对循环水装置的投资和成本分析，阐述了建设该装置的经济性和社会意义。     

Estimating and reducing the memory requirements of signal processing codes for embedded systems

Most embedded systems have limited amount of memory. In contrast, the memory requirements of the digital signal processing (DSP) and video processing codes (in nested loops, in particular) running on embedded systems is significant. This paper addresses the problem of estimating and reducing the amount of memory needed for transfers of data in embedded systems. First, the problem of estimating the region associated with a statement or the set of elements referenced by a statement during the execution of nested loops is analyzed. For a fixed execution ordering, a quantitative analysis of the number of elements referenced is presented; exact expressions for uniformly generated references and a close upper and lower bound for nonuniformly generated references are derived. Second, in addition to presenting an algorithm that computes the total memory required, this paper also discusses the effect of transformations (that change the execution ordering) on the lifetimes of array variables, i.e., the time between the first and last accesses to a given array location. The term maximum window size is introduced, and quantitative expressions are derived to compute the maximum window size. A detailed analysis of the effect of unimodular transformations on data locality, including the calculation of the maximum window size, is presented.